Quadratically Perturbed Chance Constrained Programming with Fitted Distribution: t-Distribution vs. Gaussian
نویسنده
چکیده
For chance-constrained programming (CCP) with non-Gaussian uncertainty, the optimization is generally intractable owing to the complicated probability density function (PDF). Using a simple fitted distribution with Kullback-Leibler (KL) divergence to represent the PDF mismatch is a systematic way to tackle CCP with non-Gaussian uncertainty. However, the essential difficulty of this methodology is to choose the fitted PDF, which should be close to the true PDF and make the resulting CCP problem solvable. In this paper, among the well-known PDFs, t-distribution rather than Gaussian is selected to be the fitted PDF. After the CCP with non-Gaussian uncertainty is transformed into CCP with a fitted PDF, the property of the regularized outage probability is analysed first. Then, the unimodal distributional properties are established for the quadratic form under t or Gaussian perturbation. Finally, based on the unimodal property and the regularized outage analysis, the analytical condition to make the safe approximation with fitted t-distribution have larger feasible set than the safe approximation with fitted Gaussian is obtained. With transceiver design under Logistic and Gaussian mixture channel uncertainties as an example, simulation results validate the less conservativeness property of the CCP with fitted t-distribution, compared to the CCP with fitted Gaussian and the classic moment method.
منابع مشابه
A Chance Constrained Integer Programming Model for Open Pit Long-Term Production Planning
The mine production planning defines a sequence of block extraction to obtain the highest NPV under a number of constraints. Mathematical programming has become a widespread approach to optimize production planning, for open pit mines since the 1960s. However, the previous and existing models are found to be limited in their ability to explicitly incorporate the ore grade uncertainty into the p...
متن کاملDATA ENVELOPMENT ANALYSIS WITH FUZZY RANDOM INPUTS AND OUTPUTS: A CHANCE-CONSTRAINED PROGRAMMING APPROACH
In this paper, we deal with fuzzy random variables for inputs andoutputs in Data Envelopment Analysis (DEA). These variables are considered as fuzzyrandom flat LR numbers with known distribution. The problem is to find a method forconverting the imprecise chance-constrained DEA model into a crisp one. This can bedone by first, defuzzification of imprecise probability by constructing a suitablem...
متن کاملOptimal Solution in a Constrained Distribution System
We develop a method to obtain an optimal solution for a constrained distribution system with several items and multi-retailers. The objective is to determine the procurement frequency as well as the joint shipment interval for each retailer in order to minimize the total costs. The proposed method is applicable to both nested and non-nested policies and ends up with an optimal solution. To solv...
متن کاملOn Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities
In the paper we consider the chance-constrained version of an affinely perturbed linear matrix inequality (LMI) constraint, assuming the primitive perturbations to be independent with light-tail distributions (e.g., bounded or Gaussian). Constraints of this type, playing a central role in chance-constrained linear/conic quadratic/semidefinite programming, are typically computationally intractab...
متن کاملA mixed-integer quadratically-constrained programming model for the distribution system expansion planning
This paper presents a mixed-integer quadratically-constrained programming (MIQCP) model to solve the distribution system expansion planning (DSEP) problem. The DSEP model considers the construction/ reinforcement of substations, the construction/reconductoring of circuits, the allocation of fixed capacitors banks and the radial topology modification. As the DSEP problem is a very complex mixed-...
متن کامل